Maintenance scheduling of power generators is of particular importance for power grids from both economic and reliability aspects. In this paper, the discrete Firefly Algorithm is implemented for maintenance scheduling of generators. This project utilizes the combination of the discrete Firefly Algorithm, as the main tool, and heuristic methods, as the secondary tool, for constructing initial solutions and searching the solution space. The paper investigates a case study consisting of a 32-generator problem formulated as a mixed-integer problem. The performance of the proposed method is compared with those in the literature and its strengths and weaknesses are discussed. The obtained results showed that performance of the proposed Algorithm is not highly affected by its parameters’ values and is capable of providing multiple efficient maintenance schedules in a desirable time.

Evolutionary Algorithms are among the most powerful Algorithms for optimization, Firefly Algorithm (FA) is one of them that inspired by nature. It is an easily implementable, robust, simple and flexible technique. On the other hand, Integration of this Algorithm with other Algorithms, can be improved the performance of FA. Particle Swarm Optimization (PSO) and Gravitational Search Algorithm (GSA) are suitable and effective for integration with FA. Some method and operation in GSA and PSO can help to FA for fast and smart searching. In one version of the Gravitational Search Algorithm (GSA), selecting the K-best particles with bigger mass, and examining its effect on other masses has a great help for achieving the faster and more accurate in optimal answer. As well as, in Particle Swarm Optimization (PSO), the candidate answers for solving optimization problem, are guided by local best position and global best position to achieving optimal answer. These operators and their combination with the Firefly Algorithm (FA) can improve the performance of the search Algorithm. This paper intends to provide models for improvement Firefly Algorithm using GSA and PSO operation. For this purpose, 5 scenarios are defined and then, their models are simulated using MATLAB software. Finally, by reviewing the results, It is shown that the performance of introduced models are better than the standard Firefly Algorithm.

In this paper, we have investigated a new spectral Quasi-Newton (QN) Algorithm. New search directions of the proposed Algorithm increase its stability and increase the arrival to the optimum solution with a lowest cost value and our numerical applications on the standard Firefly Algorithm (FA)and the new proposed Algorithm are powerful as in meta-heuristic field. Our new proposed Algorithm has quite common uses in several sciences and engineering problems. Finally, our numerical results show that the proposed technique is the best and its accuracy higher than the accuracy of the standard FA. These numerical results are compared using statistical analysis to evaluate the efficiency and the robustness of new proposed Algorithm.

In data grid, using reservation is accepted to provide scheduling and service quality.Users need to have an access to the stored data in geographical environment, which can be solved by using replication, and an action taken to reach certainty. As a result, users are directed toward the nearest version to access information. The most important point is to know in which sites and distributed system the produced versions are located. By selecting a suitable place for versions, the versions having performance, efficiency and lower access time are used. In this study, an efficient method is presented to select the best place for those versions created in data grid by using the users’ Firefly Algorithm which is compared with two Algorithms. Results show that Firefly Algorithm has better performance than others.

In this paper, a new and an effective combination of two metaheuristic Algorithms, namely Firefly Algorithm and the Differential evolution, has been proposed. This hybridization called as HFADE, consists of two phases of Differential Evolution (DE) and Firefly Algorithm (FA). Firefly Algorithm is the nature-inspired Algorithm which has its roots in the light intensity attraction process of Firefly in the nature. Differential evolution is an Evolutionary Algorithm that uses the evolutionary operators like selection, recombination and mutation. FA and DE together are effective and powerful Algorithms but FA Algorithm depends on random directions for search which led into retardation in finding the best solution and DE needs more iteration to find proper solution. As a result, this proposed method has been designed to cover each Algorithm deficiencies so as to make them more suitable for optimization in real world domain. To obtain the required results, the experiment on a set of benchmark functions was performed and findings showed that HFADE is a more preferable and effective method in solving the high-dimensional functions.